Further evidence for zero crossing on the three gluon vertex
نویسندگان
چکیده
منابع مشابه
The Form Factors of the Gauge-Invariant Three-Gluon Vertex
The gauge-invariant three-gluon vertex obtained from the pinch technique is characterized by thirteen nonzero form factors, which are given in complete generality for unbroken gauge theory at one loop. The results are given in d dimensions using both dimensional regularization and dimensional reduction, including the effects of massless gluons and arbitrary representations of massive gauge boso...
متن کاملOne-loop Results for Three-gluon Vertex in Arbitrary Gauge and Dimension * One-loop Results for Three-gluon Vertex in Arbitrary Gauge and Dimension
We review the calculation of one-loop contributions to the three-gluon vertex, for arbitrary (off-shell) external momenta, in arbitrary covariant gauge and in arbitrary space-time dimension. We discuss how one can get the results for all on-shell limits of interest directly from the general off-shell expression. We review the calculation of one-loop contributions to the three-gluon vertex, for ...
متن کاملSemiperturbative construction for the quark-gluon vertex
We construct a model for the quark-gluon vertex of Landau gauge QCD. This is of twofold interest: on the one hand the quark-gluon interaction is at the heart of quark confinement, on the other hand it is a central element in hadron phenomenology based on QCD Greens functions. We employ the non-Abelian one-loop diagram in perturbation theory, which is of order Nc. As a novelty we replace the tre...
متن کاملThree-gluon vertex in arbitrary gauge and dimension.
One-loop off-shell contributions to the three-gluon vertex are calculated, in arbitrary covariant gauge and in arbitrary space-time dimension, including quark-loop contributions (with massless quarks). It is shown how one can get the results for all on-shell limits of interest directly from the general off-shell expression. The corresponding general expressions for the one-loop ghost-gluon vert...
متن کاملvertex centered crossing number for maximal planar graph
the crossing number of a graph is the minimum number of edge crossings over all possible drawings of in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 2016
ISSN: 2470-0010,2470-0029
DOI: 10.1103/physrevd.94.074502